class Solution {
public:
bool find(vetor<int>& matrix,int target){
    int l=0,h=matrix.size()-1;

    for(int i=0,i<matrix,i++){}
        while(l<=h){
            int mid=(l+h)/2;
            if(matrix[mid]==target){
                return true;
            }else if(matrix[mid]<target){
                l=mid+1;else{h=mid-1;}
}
    bool searchMatrix(vector<vector<int>>& matrix, int target) {
        for(int i=0;i<matrix.size();i++){
            if(find(matrix[i],target)){
                return true;
            }
            else {
                return false;
            }
    }
};